Multivariate Broadcast Encryption with Group Key Algorithm for Secured IoT

نویسندگان

چکیده

The expanding and ubiquitous availability of the Internet Things (IoT) have changed everyone’s life easier more convenient. Same time it also offers a number issues, such as effectiveness, security, excessive power consumption, which constitute danger to intelligent IoT-based apps. Group managing is primarily used for transmitting multi-pathing communications that are secured with general group key can only be decrypted by an authorized member. A centralized trustworthy system, in charge distribution upgrades, maintain keys. To provide longitudinal access controls, Software Defined Network (SDN) based security controllers employed administration services. Cloud service providers variety features. There just few software answers available. In proposed hybrid protocols were SDN embeds edge system improve communication. Tree-based algorithms compared Key Establishment (GKE) Multivariate public cryptosystem Broadcast Encryption system. When all factors considered, (BE) appears become most logical solution issue. BE enables initiator send encrypted messages large set recipients efficient productive way, meanwhile assuring data defining characteristic. method improves efficiency reduces consumption minimizes cost.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bridging Broadcast Encryption and Group Key Agreement

Broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but requires a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude ...

متن کامل

Public Key Broadcast Encryption for Stateless Receivers

A broadcast encryption scheme allows the sender to securely distribute data to a dynamically changing set of users over an insecure channel. One of the most challenging settings for this problem is that of stateless receivers, where each user is given a fixed set of keys which cannot be updated through the lifetime of the system. This setting was considered by Naor, Naor and Lotspiech [17], who...

متن کامل

Key Preassigned Traceability Schemes for Broadcast Encryption

Traceability schemes for broadcast encryption are deened by Chor, Fiat and Naor in 6] to protect against a possible coalition of users producing an illegal decryption key. Their scheme was then generalized by Stinson and Wei in 17]. These schemes assume that every user can decrypt the secret value. In this paper we discuss key preassigned tra-cability schemes, in which only the users in a speci...

متن کامل

Tree based symmetric key broadcast encryption

The most influential broadcast encryption (BE) scheme till date was introduced in 2001 by Naor, Naor and Lotspiech (NNL) and is based on binary trees. This paper generalizes the ideas of NNL to obtain BE schemes based on k-ary trees for any k ≥ 2. The treatment is uniform across all k and essentially provides a single scheme which is parameterized by the arity of the underlying tree. We perform...

متن کامل

A key-policy attribute-based broadcast encryption

According to the broadcast encryption scheme with wide applications in the real world without considering its security and efficiency in the model simultaneously an “unbounded”, Key-Policy Attribute-Based Broadcast Encryption scheme(KP-ABBE) was proposed by combining with waters dual system encryption, attribute-based encryption and broadcast encryption system. Based on the standard model, the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer systems science and engineering

سال: 2023

ISSN: ['0267-6192']

DOI: https://doi.org/10.32604/csse.2023.027315